Hamiltonicity of 3-connected generalized bull-free line graphs
نویسندگان
چکیده
For graphs G and H, G is said to be H-free if G has no induced subgraph isomorphic to H. For integers s and t with 1 ≤ s ≤ t, let Bs,t be a graph obtained by attaching each of some two distinct vertices of a triangle to an end vertex of one of two vertex-disjoint paths of orders s and t. In this paper, we prove that every 3-connected Bs,9−s-free line graph is Hamiltonian for an integer s with 1 ≤ s ≤ 4.
منابع مشابه
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
In this paper, we consider forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. Let Zi be the graph obtaind from a triangle by attaching a path of length i to one of its vertices, and let Q∗ be the graph obtained from the Petersen graph by adding one pendant edge to each vertex. Lai et al. [J. Graph Theory 64 (2010), no. 1, 1-11] conjectured that every 3-connected {K1,3, Z9}-f...
متن کاملOn 3-connected hamiltonian line graphs
Thomassen conjectured that every 4-connected line graph is hamiltonian. It has been proved that every 4-connected line graph of a claw-free graph, or an almost claw-free graph, or a quasi-claw-free graph, is hamiltonian. In 1998, Ainouche et al. [2] introduced the class of DCT graphs, which properly contains both the almost claw-free graphs and the quasi-claw-free graphs. Recently, Broersma and...
متن کاملOn a Closure Concept in Claw-Free Graphs
If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A suucient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on hamiltonicity in 2-tough graphs and the hamiltonicity of 7-connected c...
متن کاملPancyclicity of 4-connected {claw, generalized bull}-free graphs
A graph G is pancyclic if it contains cycles of each length `, 3 ≤ ` ≤ |V (G)|. The generalized bull B(i, j) is obtained by associating one endpoint of each of the paths Pi+1 and Pj+1 with distinct vertices of a triangle. Gould, Luczak and Pfender [4] showed that if G is a 3-connected {K1,3, B(i, j)}-free graph with i + j = 4 then G is pancyclic. In this paper, we prove that every 4-connected, ...
متن کاملHamiltonicity and forbidden subgraphs in 4-connected graphs
Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3, 1, 1, 1, 1, 1), i.e. T is a chain of three triangles. We show that every 4-connected {T,K1,3}-free graph has a hamiltonian cycle.
متن کامل